A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma

In computational complexity, a complexity class is given by a set of problems or functions, and a basic challenge is to show separations of complexity classes A 6= B especially when A is known to be a subset of B. In this paper we introduce a homological theory of functions that can be used to establish complexity separations, while also providing other interesting consequences. We propose to associate a topological space SA to each class of functions A, such that, to separate complexity classes A ⊆ B′, it suffices to observe a change in “the number of holes”, i.e. homology, in SA as a subclass B ⊆ B′ is added to A. In other words, if the homologies of SA and SA∪B are different, then A 6= B′. We develop the underlying theory of functions based on homological commutative algebra and Stanley-Reisner theory, and prove a “maximal principle” for polynomial threshold functions that is used to recover Aspnes, Beigel, Furst, and Rudich’s characterization of the polynomial threshold degree of symmetric functions. A surprising coincidence is demonstrated, where, roughly speaking, the maximal dimension of “holes” in SA upper bounds the VC dimension of A, with equality for common computational cases such as the class of polynomial threshold functions or the class of linear functionals over F2, or common algebraic cases such as when the Stanley-Reisner ring of SA is Cohen-Macaulay. As another interesting application of our theory, we prove a result that a priori has nothing to do with complexity separation: it characterizes when a vector subspace intersects the positive cone, in terms of homological conditions. By analogy to Farkas’ result doing the same with linear conditions, we call our theorem the Homological Farkas Lemma. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, I.2.6 Learning, G.2.1 Combinatorics, G.2.m Miscellaneous